Spanning Trees of Lattices Embedded on the Klein Bottle
نویسنده
چکیده
The problem of enumerating spanning trees in lattices with Klein bottle boundary condition is considered here. The exact closed-form expressions of the numbers of spanning trees for 4.8.8 lattice, hexagonal lattice, and 3(3) · 4(2) lattice on the Klein bottle are presented.
منابع مشابه
Spanning trees on hypercubic lattices and nonorientable surfaces
We consider the problem of enumerating spanning trees on lattices. Closed-form expressions are obtained for the spanning tree generating function for a hypercubic lattice of size N1×N2×· · ·×Nd in d dimensions under free, periodic, and a combination of free and periodic boundary conditions. Results are also obtained for a simple quartic net embedded on two non-orientable surfaces, a Möbius stri...
متن کاملAsymptotic Energy of Lattices
Abstract. The energy of a simple graph G arising in chemical physics, denoted by E(G), is defined as the sum of the absolute values of eigenvalues of G. As the dimer problem and spanning trees problem in statistical physics, in this paper we propose the energy per vertex problem for lattice systems. In general for a type of lattices in statistical physics, to compute the entropy constant with t...
متن کاملDimer statistics on the Möbius strip and the Klein bottle
Closed-form expressions are obtained for the generating function of close-packed dimers on a 2M × 2N simple quartic lattice embedded on a Möbius strip and a Klein bottle. Finite-size corrections are also analyzed and compared with those under cylindrical and free boundary conditions. Particularly, it is found that, for large lattices of the same size and with a square symmetry, the number of di...
متن کاملSmall snarks and 6-chromatic triangulations on the Klein bottle
It is known that for every nonorientable surface there are infinitely many (large) snarks that can be polyhedrally embedded on that surface. We take a dual approach to the embedding of snarks on the Klein bottle, and investigate edge-colorings of 6-chromatic triangulations of the Klein bottle. In the process, we discover the smallest snarks that can be polyhedrally embedded on the Klein bottle....
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
دوره 2014 شماره
صفحات -
تاریخ انتشار 2014